A monotone version of the Sokolov property and monotone retractability in function spaces

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Monotone Retractability into Simple Arcs

Radó has noted that (II) implies (r) and that the sphere and 2-cell each have (II). In this paper it will be shown that (1) for locally connected continua in general, property (II) is equivalent to unicoherence, (2) for plane locally connected continua, property (ir) is equivalent to unicoherence, and (3) every closed 2-dimensional connected manifold has property (x). To clarify our meaning, we...

متن کامل

On the Monotone Mappings in CAT(0) Spaces

In this paper, we first introduce a monotone mapping and its resolvent in general metric spaces.Then, we give two new iterative methods  by combining the resolvent method with Halpern's iterative method and viscosity approximation method for  finding a fixed point of monotone mappings and a solution of variational inequalities. We prove convergence theorems of the proposed iterations  in ...

متن کامل

Monotone and Pseudo-monotone Equilibrium Problems in Hadamard Spaces

As a continuation of previous work of the first author with S. Ranjbar [26] on a special form of variational inequalities in Hadamard spaces, in this paper we study equilibrium problems in Hadamard spaces, which extend variational inequalities and many other problems in nonlinear analysis. In this paper, first we study the existence of solutions of equilibrium problems associated with pseudomon...

متن کامل

Connectedness in Monotone Spaces SAIBAL

In this paper connectedness is studied in weaker (monotone, quasi-directed) spaces and we examine sets having the ending property (e.p.). 2000 Mathematics Subject Classification: 54A99, 54C05

متن کامل

On the Typical Structure of Graphs in a Monotone Property

Given a graph property P, it is interesting to determine the typical structure of graphs that satisfy P. In this paper, we consider monotone properties, that is, properties that are closed under taking subgraphs. Using results from the theory of graph limits, we show that if P is a monotone property and r is the largest integer for which every r-colorable graph satis es P, then almost every gra...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematical Analysis and Applications

سال: 2014

ISSN: 0022-247X

DOI: 10.1016/j.jmaa.2013.10.043